#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int a[maxn];
bool gj[maxn];//1 bukeyigongji
bool cj[maxn];//1 chuju
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    a[n+1]=INT_MAX;
    int x=n;
    for(int l=1;l<=n;l++){
        int j=upper_bound(a+l+1,a+n+1,a[l])-a;
        if(j==n+1) break;
        if(cj[j]==0&&gj[j]==0){
            x--;
            cj[l]=1;
            gj[j]=1;
        } else {
            int tmp=0;
            for(int i=j+1;i<=n;i++){
                if(gj[i]==0&&cj[i]==0){
                    tmp=i;
                    break;
                }
            }
            if(tmp==0){
                break;
            } else {
                cj[l]=1;
                gj[tmp]=1;
                x--;
            }
        }
    }
    printf("%d",x);
    return 0;
}
